Parametric Mixed Sequent Calculus
نویسندگان
چکیده
In this paper, we present a propositional sequent calculus containing disjoint copies of classical and intuitionistic logics. We prove a cut-elimination theorem and we establish a relation between this system and linear logic.
منابع مشابه
Approaches to Polymorphism in Classical Sequent Calculus
X is a relatively new, untyped calculus, invented to give a CurryHoward correspondence with Classical Implicative Sequent Calculus. It is already known to provide a very expressive language; embeddings have been defined of the λ-calculus, Bloo and Rose’s λx, Parigot’s λμ and Curien and Herbelin’s λμμ̃. We investigate various notions of polymorphism in the context of the X -calculus. In particula...
متن کاملPropositional mixed logic: its syntax and semantics
In this paper, we present a propositional logic (called mixed logic) containing disjoint copies of minimal, intuitionistic and classical logics. We prove a completeness theorem for this logic with respect to a Kripke semantics. We establish some relations between mixed logic and minimal, intuitionistic and classical logics. We present at the end a sequent calculus version for this logic.
متن کاملDifferential Dynamic Logic for Verifying Parametric Hybrid Systems
We introduce a first-order dynamic logic for reasoning about systems with discrete and continuous state transitions, and we present a sequent calculus for this logic. As a uniform model, our logic supports hybrid programs with discrete and differential actions. For handling real arithmetic during proofs, we lift quantifier elimination to dynamic logic. To obtain a modular combination, we use si...
متن کاملA DPLL-Based Calculus for Ground Satisfiability Modulo Theories
We describe and discuss DPLL(T ), a parametric calculus for proving the satisfiability of ground formulas in a logical theory T . The calculus tightly integrates a decision procedure for the satisfiability in T of sets of literals into a sequent calculus based on the well-known method by Davis, Putman, Logemann and Loveland for proving the satisfiability of propositional formulas. For being bas...
متن کاملA focused framework for emulating modal proof systems
Several deductive formalisms (e.g., sequent, nested sequent, labeled sequent, hypersequent calculi) have been used in the literature for the treatment of modal logics, and some connections between these formalisms are already known. Here we propose a general framework, which is based on a focused version of the labeled sequent calculus by Negri, augmented with some parametric devices allowing t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009